Subgoal length versus full solution length in predicting Tower of Hanoi problem-solving performance

Predicting full-length transcripts.

genes in genomic DNA. Curr. Opin. Struct. Biol. 8, 346–354 10 Stormo, G.D. (2000) Gene-finding approaches for eukaryotes. Genome Res. 10, 394–397 11 Reese, M.G. et al. (2000) Genome annotation assessment in Drosophila melanogaster. Genome Res. 10, 483–501 12 Gelfand, M.S. et al. (1996) Gene recognition via spliced sequence alignment. Proc. Natl. Acad. Sci. U. S. A. 93, 9061–9066 13 Florea, L. e...

A Computational Model of Tower of Hanoi Problem Solving

Hop eld Networks for Solving Tower of Hanoi Problem

In this paper, Hop eld neural networks have been considered in solving tower of Hanoi test which is used in determining of de cit of planning capability of human prefrontal cortex. The main di erence of this work from the ones in the literature which use neural networks, is: The tower of Hanoi problem has been formulated here as a special shortest path problem. In the literature, some Hop eld n...

Tracing Problem Solving in Real Time: fMRI Analysis of the Subject-paced Tower of Hanoi

Previous research has found three brain regions for tracking components of the ACT-R cognitive architecture: a posterior parietal region that tracks changes in problem representation, a prefrontal region that tracks retrieval of task-relevant information, and a motor region that tracks the programming of manual responses. This prior research has used relatively simple tasks to incorporate a slo...

Solving the Tower of Hanoi with Random Moves

The Tower of Hanoi puzzle consists of n disks of distinct sizes distributed across 3 pegs. We will refer to a particular distribution of the disks across the pegs as a state and call it valid if on each peg disks form a pile with the disk sizes decreasing from bottom up. Since each disk can reside at one of 3 pegs, while the order of disks on each peg is uniquely defined by their sizes, the tot...